Customizable Web Services Matching and Ranking Tool: Implementation and Evaluation
نویسندگان
چکیده
The matchmaking is a crucial operation in Web service discovery and selection. The objective of the matchmaking is to discover and select the most appropriate Web service among the different available candidates. Different matchmaking frameworks are now available in the literature but most of them present at least one of the following shortcomings: (i) use of strict syntactic matching; (ii) use of capability-based matching; (iii) lack of customization support; and (iv) lack of accurate ranking of matching Web services. The objective of this paper is thus to present the design, implementation and evaluation of the Parameterized Matching-Ranking Framework (PMRF). The PMRF uses semantic matchmaking, accepts capability and property attributes, supports different levels of customization and generates a ranked list of Web services. Accordingly, it fully overcomes the first, third and fourth shortcomings enumerated earlier and partially addresses the second one. The PMRF is composed of two layers. The role of the first layer is to parse the input data and parameters and then transfer it to the second layer, which represents the matching and ranking engine. The comparison of PMRF to iSeM-logic-based and SPARQLent, using the OWLS-TC4 datasets, shows that the algorithms supported by PMRF outperform those proposed in iSeM-logic-based and SPARQLent.
منابع مشابه
Parameterized Algorithms for Matching and Ranking Web Services - (Short Paper)
The paper presents two parameterized and customizable algorithms for matching and ranking Web services. Given a user query and a set of available Web services, the matching algorithm performs a logic-based semantic matchmaking to select services that functionally match the query and maintains those which fully verify the constraints specified by the user. The ranking algorithm takes as input th...
متن کاملUsing Generalized Language Model for Question Matching
Question and answering service is one of the popular services in the World Wide Web. The main goal of these services is to finding the best answer for user's input question as quick as possible. In order to achieve this aim, most of these use new techniques foe question matching. . We have a lot of question and answering services in Persian web, so it seems that developing a question matching m...
متن کاملSAWSDL-iMatcher: A customizable and effective Semantic Web Service matchmaker
As the number of publicly available services grows, discovering proper services becomes an important issue and has attracted amount of attempts. This paper presents a new customizable and effective matchmaker, called SAWSDL-iMatcher. It supports a matchmaking mechanism, named iXQuery, which extends XQuery with various similarity joins for SAWSDL service discovery. Using SAWSDL-iMatcher, users c...
متن کاملA procedure for Web Service Selection Using WS-Policy Semantic Matching
In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...
متن کاملQoS-Aware Parameterized Semantic Matchmaking Framework for Web Service Composition
The paper presents a parameterized and highly customizable semantic matchmaking framework. The matchmaking approach on which this framework is based distinguishes three types of matching: functional attributelevel matching, functional service-level matching, and non-functional matching. The functional matching permits to eliminate web services that fail to meet the user functional requirements....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016